Kernel methods for regression in continuous time over subsets and manifolds

نویسندگان

چکیده

This paper derives error bounds for regression in continuous time over subsets of certain types Riemannian manifolds. The problem is typically driven by a nonlinear evolution law taking values on the manifold, and it cast as one optimal estimation reproducing kernel Hilbert space. A new notion persistency excitation (PE) defined rates convergence estimates are derived using PE condition. We discuss analyze two approximation methods exact solution. then conclude with some numerical simulations that illustrate qualitative character computed function estimates. Examples generated trajectory Lorenz system based experimental motion capture data included.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Geometry Preserving Kernel over Riemannian Manifolds

Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...

متن کامل

Regression on manifolds using kernel dimension reduction

We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads of research. On the one hand, the literature on sufficient dimension reduction has focused on methods for finding the best linear subspace for nonlinear regression; we extend this to manifolds. On the other hand, the l...

متن کامل

Kernel Regression for Signals over Graphs

We propose kernel regression for signals over graphs. The optimal regression coefficients are learnt using a constraint that the target vector is a smooth signal over an underlying graph. The constraint is imposed using a graph-Laplacian based regularization. We discuss how the proposed kernel regression exhibits a smoothing effect, simultaneously achieving noise-reduction and graph-smoothness....

متن کامل

Nonparametric Regression Using Kernel and Spline Methods

When applying nonparametric regression methods, the researcher is interested in estimating the relationship between one dependent variable, Y , and one or several covariates, X1, . . . , Xq. We discuss here the situation with one covariate, X (the case with multiple covariates is addressed in the references provided below). The relationship between X and Y can be expressed as the conditional ex...

متن کامل

Ensemble Kernel Learning Model for Prediction of Time Series Based on the Support Vector Regression and Meta Heuristic Search

In this paper, a method for predicting time series is presented. Time series prediction is a process which predicted future system values based on information obtained from past and present data points. Time series prediction models are widely used in various fields of engineering, economics, etc. The main purpose of using different models for time series prediction is to make the forecast with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nonlinear Dynamics

سال: 2023

ISSN: ['1573-269X', '0924-090X']

DOI: https://doi.org/10.1007/s11071-023-08567-8